Anytime Chart Realization with CCG
نویسنده
چکیده
We describe an anytime chart realization algorithm for Combinatory Categorial Grammar (CCG) that essentially interleaves the packing and unpacking stages employed in previous hybrid symbolicstatistical approaches. With this algorithm, it becomes possible to use statistical language models both for improving the quality of the output text and for increasing the speed with which it is produced. In a case study, we describe an example-driven method of developing ngram models for use in a dialogue system, and show that with these models, the algorithm is capable of cutting realization times—and their standard deviations—in half, compared to the two-stage approach, while also achieving very high quality.
منابع مشابه
Efficient Realization of Coordinate Structures in Combinatory Categorial Grammar
We describe a chart realization algorithm for Combinatory Categorial Grammar (CCG), and show how it can be used to efficiently realize a wide range of coordination phenomena, including argument cluster coordination and gapping. The algorithm incorporates three novel methods for improving the efficiency of chart realization: (i) using rules to chunk the input logical form into sub-problems to be...
متن کاملReining in CCG Chart Realization
We present a novel ensemble of six methods for improving the efficiency of chart realization. The methods are couched in the framework of Combinatory Categorial Grammar (CCG), but we conjecture that they can be adapted to related grammatical frameworks as well. The ensemble includes two new methods introduced here— feature-based licensing and instantiation of edges, and caching of category comb...
متن کاملAdapting Chart Realization to CCG
We describe a bottom-up chart realization algorithm adapted for use with Combinatory Categorial Grammar (CCG), and show how it can be used to efficiently realize a wide range of coordination phenomena, including argument cluster coordination and gapping. The algorithm has been implemented as an extension to the OpenNLP open source CCG parser. As an avenue for future exploration, we also suggest...
متن کاملHypertagging: Supertagging for Surface Realization with CCG
In lexicalized grammatical formalisms, it is possible to separate lexical category assignment from the combinatory processes that make use of such categories, such as parsing and realization. We adapt techniques from supertagging — a relatively recent technique that performs complex lexical tagging before full parsing (Bangalore and Joshi, 1999; Clark, 2002) — for chart realization in OpenCCG, ...
متن کاملGlue Rules for Robust Chart Realization
This paper shows how glue rules can be used to increase the robustness of statistical chart realization in a manner inspired by dependency realization. Unlike the use of glue rules in MT—but like previous work with XLE on improving robustness with hand-crafted grammars—they are invoked here as a fallback option when no grammatically complete realization can be found. The method works with Combi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005